Approximate word matching with synchronized rational relations
نویسنده
چکیده
Algorithms that use approximate word matching are widely used in different areas. We present the work in progress on a method that has the potential to select extremely fast from a large dictionary of correct words a small set of words that are proximate to a given input erroneous word. The method can be applied for a large class of distances based on weighted edit operations. By given distance, we build a two-tape transducer whose language is a rational relation with bounded length difference. In this paper we present an algorithm for synchronizing a rational relation with bounded length difference. We show how our method could be applied for automatic correction of OCR-ed text.
منابع مشابه
Adaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملApproximate String Matching and the Automation of Word Games
In this paper we discuss the utility of approximate string matching procedures in the automation of various aspects of word game construction and solution. These procedures are then related to the underlying issues in computational linguistics.
متن کاملA Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
This paper deals with the approximate string-matching problem with Hamming distance. The approximate string-matching with kmismatches problem is to find all locations at which a query of length m matches a factor of a text of length n with k or fewer mismatches. The approximate string-matching algorithms have both pleasing theoretical features, as well as direct applications, especially in comp...
متن کاملThree Different Methods for Approximate Analysis of Bar Structures
In this paper, modified solutions were compared through utilizing three different approximate methods for bar structures. The modifications considered various changes in the initial design. To authors' best of knowledge, the studies have carried out on this matter so far are not broad enough and have considerred the simeltaneous variations of size, geometry and topology on the bar structures. I...
متن کاملApplications of Approximate Word Matching in InformationRetrievalJames
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the eeective retrieval of information. The need to discover and reconcile variant forms of strings in bibliographic entries, i.e., authority work, will become more diicult. Spelling variants, misspellings, and transliteration diiere...
متن کامل